Recognizing Top-Monotonic Preference Profiles in Polynomial Time
نویسندگان
چکیده
منابع مشابه
Recognizing Top-Monotonic Preference Profiles in Polynomial Time
We provide the first polynomial-time algorithm for recognizing if a profile of (possibly weak) preference orders is top-monotonic. Top-monotonicity is a generalization of the notions of single-peakedness and single-crossingness, defined by Barberà and Moreno. Top-monotonic profiles always have weak Condorcet winners and satisfy a variant of the median voter theorem. Our algorithm proceeds by re...
متن کاملRecognizing permutation functions in polynomial time
Let Fq be a finite field and f(x) ∈ Fq(x) be a rational function over Fq. The decision problem PermFunction consists of deciding whether f(x) induces a permutation on the elements of Fq. That is, we want to decide whether the corresponding map f : Fq 7→ Fq defined by a 7→ f(a) is a bijective mapping or not. This problem was known to be in ZPP but not known to be in P. We resolve the complexity ...
متن کاملRecognizing hyperelliptic graphs in polynomial time
Recently, a new set of multigraph parameters was defined, called “gonalities”. Gonality bears some similarity to treewidth, and is a relevant graph parameter for problems in number theory and multigraph algorithms. Multigraphs of gonality 1 are trees. We consider so-called “hyperelliptic graphs” (multigraphs of gonality 2) and provide a safe and complete sets of reduction rules for such multigr...
متن کاملRecognizing Linked Domain in Polynomial Time
The celebrated Gibbard-Satterthwaite Theorem [2, 4] states that when there are more than two candidates, any surjective social choice function which is defined over the universal domain of preferences and is strategy-proof must be dictatorial. Aswal, Chatterji and Sen generalize [1] the Gibbard-Satterthwaite theorem by showing that the Gibbard-Satterthwaite theorem still holds if the universal ...
متن کاملRecognizing Circulant Graphs of Prime Order in Polynomial Time Recognizing Circulant Graphs of Prime Order in Polynomial Time
1 Abstract In this paper we present a time-polynomial recognition algorithm for circulant graphs of prime order. A circulant graph G of order n is a Cayley graph over the cyclic group Z n : Equivalently, G is circulant ii its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a coherent connguration A and, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2019
ISSN: 1076-9757
DOI: 10.1613/jair.1.11331